Hierarchical hp-adaptive signed distance fields
نویسندگان
چکیده
In this paper we propose a novel method to construct hierarchical hp-adaptive Signed Distance Fields (SDFs). We discretize the signed distance function of an input mesh using piecewise polynomials on an axis-aligned hexahedral grid. Besides spatial refinement based on octree subdivision to refine the cell size (h), we hierarchically increase each cell’s polynomial degree (p) in order to construct a very accurate but memory-efficient representation. Presenting a novel criterion to decide whether to apply hor p-refinement, we demonstrate that our method is able to construct more accurate SDFs at significantly lower memory consumption than previous approaches. Finally, we demonstrate the usage of our representation as collision detector for geometrically highly complex solid objects in the application area of physically-based simulation.
منابع مشابه
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient access to distance (error) estimates. In this paper we present an algorithm to compute a piecewise linear, not necessarily continuous approximation of the signed distance field for a given object. Our approach is based on...
متن کاملAn hp-Adaptive Discretization Algorithm for Signed Distance Field Generation
In this paper we present an hp-adaptive algorithm to generate discrete higher-order polynomial Signed Distance Fields (SDFs) on axis-aligned hexahedral grids from manifold polygonal input meshes. Using an orthonormal polynomial basis, we efficiently fit the polynomials to the underlying signed distance function on each cell. The proposed error-driven construction algorithm is globally adaptive ...
متن کاملFast Hierarchical 3D Distance Transforms on the GPU
This paper describes a novel approach for the GPU-based computation of approximate 3D Euclidean distance transforms, i.e. distance fields with associated vector information to the closest object point. Our hierarchical method works on discrete voxel grids and uses a propagation technique, both on a single hierarchy level and between the levels. We assume a closed object, so that a signed distan...
متن کاملInteractive Ray-tracing Based on OptiX to Visualize Signed Distance Fields
We propose a parallel ray-tracing technique to visualize signed distance fields generated from triangular meshes based on NVIDIA OptiX. Our method visualizes signed distance fields with various distance offset values at interactive rates (2–12 fps). Our method utilizes a parallel kd-tree implementation to query the nearest triangle and the sphere tracing method to visualize the implicit surface.
متن کاملThe hp-multigrid method applied to hp-adaptive refinement of triangular grids
Recently the hp version of the finite element method, in which adaptivity occurs in both the size, h, of the elements and in the order, p, of the approximating piecewise polynomials, has received increasing attention. It is desirable to combine this optimal order discretization method with an optimal order algebraic solution method, such as multigrid. An intriguing notion is to use the values o...
متن کامل